Distributed model-independent consensus of Euler-Lagrange agents on directed networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed model-independent consensus of Euler–Lagrange agents on directed networks

This paper proposes a distributed model-independent algorithm to achieve leaderless consensus on a directed network where each fully-actuated agent has self-dynamics described by Euler–Lagrange equations of motion. Specifically, we aim to achieve consensus of the generalised coordinates with zero generalised velocity. We show that on a strongly connected graph, a model-independent algorithm can...

متن کامل

Leader Tracking of Euler-Lagrange Agents on Directed Switching Networks Using A Model-Independent Algorithm

In this paper, we propose a discontinuous distributed model-independent algorithm for a directed network of EulerLagrange agents to track the trajectory of a leader with nonconstant velocity. We initially study a fixed network and show that the leader tracking objective is achieved semi-globally exponentially fast if the graph contains a directed spanning tree. By model-independent, we mean tha...

متن کامل

Distributed leaderless consensus algorithms for networked Euler-Lagrange systems

This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange systems. We propose a fundamental consensus algorithm, a consensus algorithm accounting for actuator saturation, and a consensus algorithm accounting for unavailability of measurements of generalised coordinate derivatives, for systems modelled by Euler–Lagrange equati...

متن کامل

Distributed δ-consensus in directed delayed networks of multi-agents ?

In this brief we propose a distributed δ-consensus protocol in directed networks of dynamic agents having communication delays. We provide convergence analysis for such consensus algorithm under stochastic switching communication graphs, and then present some generic criteria for solving the average consensus problem. We also show that directed delayed networks of dynamic agents can achieve ave...

متن کامل

Trajectory Tracking and Consensus of Networks of Euler-Lagrange Systems

This paper addresses the problem of synchronizing networks of nonidentical, nonlinear dynamical systems described by Euler–Lagrange equations. It is assumed that the communication graph is simply connected and that the systems are fully actuated, with their states available for measurement. The communications can be subject to constant time-delays. The main result of the paper is a controller f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Robust and Nonlinear Control

سال: 2016

ISSN: 1049-8923

DOI: 10.1002/rnc.3689